JavaCard Program Verification
نویسنده
چکیده
منابع مشابه
Towards Development of Safe and Secure JAVACARD Applets
This thesis is concerned with different aspects of JAVACARD application development and use of formal methods in the JAVACARD world. JAVACARD is a technology that provides means to program smart (chip) cards with (a subset of) the JAVA language. The use of formal methods in the JAVACARD context is highly justified due to the criticality of JAVACARD applications. First of all, JAVACARD applicati...
متن کاملVerifying the Mondex Case Study The KeY Approach
The Mondex Case study is still the most substantial contribution to the GrandChallenge repository. It has been the target of a number of formal verifica-tion efforts. Those efforts concentrated on correctness proofs for refinementsteps of the specification in various specification formalisms using different ver-ification tools. Here, the results of full functional verification o...
متن کاملFormalisation and Verification of Java Card Security Properties in Dynamic Logic
We present how common JAVACARD security properties can be formalised in Dynamic Logic and verified, mostly automatically, with the KeY system. The properties we consider, are a large subset of properties that are of importance to the smart card industry. We discuss the properties one by one, illustrate them with examples of real-life, industrial size, JAVACARD applications, and show how the pro...
متن کاملSpecification of the JavaCard API in JML Towards formal specification and verification of applets and API implementations
This paper reports on an effort to increase the reliability of JavaCard-based smart cards by means of formal specification and verification of JavaCard source code. As a first step, lightweight formal interface specifications, written in the specification language JML, have been developed for all the classes in the JavaCard API (version 2.1). They make many of the implicit assumptions underlyin...
متن کاملA Program Logic for Handling JAVA CARD's Transaction Mechanism
In this paper we extend a program logic for verifying JAVA CARD applications by introducing a “throughout” operator that allows us to prove “strong” invariants. Strong invariants can be used to ensure “rip out” properties of JAVACARD programs (properties that are to be maintained in case of unexpected termination of the program). Along with introducing the “throughout” operator, we show how to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001